Cycle StructureofAutotopismsof Quasigroups andLatin Squares
نویسندگان
چکیده
An autotopism of a Latin square is a triple (a,b,c) of permutations such that the Latin square is mapped to itself by permuting its rows by a, columns by b, and symbols by c. Let Atp(n) be the set of all autotopisms of Latin squares of order n. Whether a triple (a,b,c) of permutations belongs to Atp(n) depends only on the cycle structures of a, b, and c. We establish a number of necessary conditions for (a,b,c) to be in Atp(n), and use them to determine Atp(n) for n≤17. For general n, we determine if (a,a,a)∈Atp(n) (that is, if a is an automorphism of some quasigroup of order n), provided that either has at most three cycles other than fixed points or that the non-fixed points of a are in cycles of the same length. 2011 Wiley Periodicals, Inc. J Combin Designs
منابع مشابه
Small Latin Squares, Quasigroups and Loops
We present the numbers of isotopy classes and main classes of Latin squares, and the numbers of isomorphism classes of quasigroups and loops, up to order 10. The best previous results were for Latin squares of order 8 (Kolesova, Lam and Thiel, 1990), quasigroups of order 6 (Bower, 2000) and loops of order 7 (Brant and Mullen, 1985). The loops of order 8 have been independently found by “QSCGZ” ...
متن کاملEvolving Quasigroups by Genetic Algorithms
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Most implementations of quasigroups are based on look-up table of the quasigroup, on system of distinct repre...
متن کاملGenetic Algorithms Evolving Quasigroups with Good Pseudorandom Properties
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Prior implementations of quasigroups were based on look-up table of the quasigroup, on system of distinct rep...
متن کاملEvans' Normal Form Theorem Revisited
Evans defined quasigroups equationally, and proved a Normal Form Theorem solving the word problem for free extensions of partial Latin squares. In this paper, quasigroups are redefined as algebras with six basic operations related by triality, manifested as coupled right and left regular actions of the symmetric group on three symbols. Triality leads to considerable simplifications in the proof...
متن کاملBlock Cipher Based on Randomly Generated Quasigroups
Quasigroups are algebraic structures closely related to Latin squares which have many different applications. The construction of block cipher is based on quasigroup string transformation. This article describes a block cipher based Quasigroup of order 256, suitable for fast software encryption of messages written down in universal ASCII code. The novelty of this cipher lies on the fact that ev...
متن کامل